Computing Local Integral Closures
نویسندگان
چکیده
منابع مشابه
Integral Closures of Ideals in Completions of Regular Local Domains
In this paper we exhibit an example of a three-dimensional regular local domain (A,n) having a height-two prime ideal P with the property that the extension P of P to the n-adic completion  of A is not integrally closed. We use a construction we have studied in earlier papers: For R = k[x, y, z], where k is a field of characteristic zero and x, y, z are indeterminates over k, the example A is...
متن کاملIntegral Closures of Cohen-macaulay Monomial Ideals
The purpose of this paper is to present a family of CohenMacaulay monomial ideals such that their integral closures have embedded components and hence are not Cohen-Macaulay.
متن کاملToric Ideals of Integral Closures from Graphs
A graph-theoretic method, simpler than existing ones, is used to characterize the minimal set of monomial generators for the integral closure of any polynomial ring generated by quadratic monomials. The toric ideal of relations between these generators is generated by a set of graphically described binomials. The spectra of the original ring and of its integral closure turn out to be canonicall...
متن کاملIntegral closures of ideals and rings
I assume some background from Atiyah–MacDonald [2] (especially the parts on Noetherian rings, primary decomposition of ideals, ring spectra, Hilbert’s Basis Theorem, completions). In the first lecture I will present the basics of integral closure with very few proofs; the proofs can be found either in Atiyah–MacDonald [2] or in Huneke–Swanson [13]. Much of the rest of the material can be found ...
متن کاملComputing Downward Closures for Stacked Counter Automata
The downward closure of a language L of words is the set of all (not necessarily contiguous) subwords of members of L. It is well known that the downward closure of any language is regular. Although the downward closure seems to be a promising abstraction, there are only few language classes for which an automaton for the downward closure is known to be computable. It is shown here that for sta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2001
ISSN: 0747-7171
DOI: 10.1006/jsco.2001.0447